Automated Termination Analysis of Polynomial Probabilistic Programs
نویسندگان
چکیده
Abstract The termination behavior of probabilistic programs depends on the outcomes random assignments. Almost sure (AST) is concerned with question whether a program terminates probability one all possible inputs. Positive almost (PAST) focuses in finite expected number steps. This paper presents fully automated approach to analysis while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST undecidable general, existing proof rules typically provide sufficient conditions. These conditions mostly involve constraints supermartingales. We consider four from literature extend these generalizations for (P)AST. automate resulting set by effectively computing asymptotic bounds polynomials over variables. used decide – including supermartingales rule. Our software tool Amber can thus check AST, PAST, as well their negations large class programs, while carrying out reasoning witnesses. Experimental results show merits our generalized demonstrate that handle reach other state-of-the-art tools.
منابع مشابه
Termination of Polynomial Programs
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical code abstraction and analysis. The technique is based on finite differences of expressions over transition systems. Although no complete method exists for determining termination for this class of loops, we show that our technique is useful in practice. We demonstrat...
متن کاملTermination Analysis of Probabilistic Programs Through Positivstellensatz's
We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and o...
متن کاملAutomated Termination Analysis for Incompletely Defined Programs
Incompletely defined programs provide an elegant and easy way to write and to reason about programs which may halt with a run time error by throwing an exception or printing an error message, e.g. when attempting to divide by zero. Due to the presence of stuck computations, which arise when calling incompletely defined procedures with invalid arguments, we cannot use the method of argument boun...
متن کاملProbabilistic Termination of CHRiSM Programs
Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is requi...
متن کاملTermination Analysis of Polynomial Programs with Equality Conditions
In this paper, we investigate the termination problem of a family of polynomial programs, in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equations. Our main result is that the non-terminating inputs of such a polynomial program is algorithmically computable according to a strictly descending chain of algebrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-72019-3_18